A bivalency proof of the lower bound for uniform consensus
نویسندگان
چکیده
Bivalency argument is a widely-used technique that employs forward induction to show impossibility results and lower bounds related to consensus. However, for a synchronous distributed system of n processes with up to t potential and f actual crash failures, applying bivalency argument to prove the lower bound for reaching uniform consensus is still an open problem. In this paper, we address this problem by presenting a bivalency proof that the lower bound for reaching uniform consensus is (f + 2)-rounds where 0 f t − 2. 2005 Elsevier B.V. All rights reserved.
منابع مشابه
A simple proof of the uniform consensus synchronous lower bound
We give a simple and intuitive proof of an f + 2 round lower bound for uniform consensus. That is, we show that for every uniform consensus algorithm tolerating t failures, and for every f t − 2, there is an execution with f failures that requires f + 2 rounds. 2002 Elsevier Science B.V. All rights reserved.
متن کاملA Unified Proof of Minimum Time Complexity for Reaching Consensus and Uniform Consensus - An Oracle-Based Approach
In this paper, we offer new proofs to two lower bound results in distributed computing: a minimum of f + 1 and f + 2 rounds for reaching consensus and uniform consensus respectively when at most f fail-stop faults can happen. Here the computation model is synchronous message passing. Both proofs are based on a novel oracle argument. These two induction proofs are unified in the following sense:...
متن کاملA Simple Bivalency Proof that t-Resilient Consensus Requires t + 1 Rounds
We use a straightforward bivalency argument borrowed from Fischer et al. [7] to show that in a synchronous system with up to t crash failures solving consensus requires at least t + 1 rounds. The proof is simpler and more intuitive than the traditional one: It uses an easy forward induction rather than a more complex backward induction which needs the induction hypothesis several times.
متن کاملعدد تناوبی گرافها
In 2015, Alishahi and Hajiabolhassan introduced the altermatic number of graphs as a lower bound for the chromatic number of them. Their proof is based on the Tucker lemma, a combinatorial counterpart of the Borsuk-Ulam theorem, which is a well-known result in topological combinatorics. In this paper, we present a combinatorial proof for the Alishahi-Hajiabolhassan theorem.
متن کاملA constructive proof for FLP
We present a simple elementary proof for the result of Fischer, Lynch, and Paterson (FLP) [J. ACM 32 (2) (April 1985) 374–382] that the consensus problem cannot be solved deterministically in an asynchronous system where a single process may fail by crashing. Our proof is, in contrast to the original, constructive in its crucial lemma, showing not only that a nonterminating execution does exist...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 96 شماره
صفحات -
تاریخ انتشار 2005